Necessary conditions for reversed Dickson polynomials to be permutational
نویسندگان
چکیده
منابع مشابه
Reversed Dickson polynomials over finite fields
Reversed Dickson polynomials over finite fields are obtained from Dickson polynomials Dn(x, a) over finite fields by reversing the roles of the indeterminate x and the parameter a. We study reversed Dickson polynomials with emphasis on their permutational properties over finite fields. We show that reversed Dickson permutation polynomials (RDPPs) are closely related to almost perfect nonlinear ...
متن کاملOn Modified Dickson Polynomials
were defined and studied by P. Fllipponi In the case a-\ in [1], where several identities and congruences were established. In this note we generalize some of those theorems and present some new properties of these polynomials. One basic result is Proposition 2 in [1] which states that if/? is an odd prime and k is an integer, then Zp(k,l) = (k\p) (mod/0, (1-2) where (k \p) is the Legendre symb...
متن کاملDickson Polynomials That Are Permutations
A theorem of S.D. Cohen gives a characterization for Dickson polynomials of the second kind that permutes the elements of a finite field of cardinality the square of the characteristic. Here, a different proof is presented for this result. 1. Permutation polynomials of finite fields. In recent years cryptographers became interested in finding polynomials that induce a bijection of a finite fiel...
متن کاملNecessary and Sufficient Conditions for Unit Graphs to Be Hamiltonian
A graph is Hamiltonian if it has a cycle that visits every vertex exactly once; such a cycle is called a Hamiltonian cycle. In general, the problem of finding a Hamiltonian cycle in a given graph is an NP-complete problem and a special case of the traveling salesman problem. It is a problem in combinatorial optimization studied in operations research and theoretical computer science; see [Garey...
متن کاملDembowski-Ostrom polynomials from Dickson polynomials
Motivated by several recent results, we determine precisely when Fk(X , a)− Fk(0, a) is a Dembowski-Ostrom polynomial, where Fk(X, a) is a Dickson polynomial of the first or second kind. As a consequence, we obtain a classification of all such polynomials which are also planar; all examples found are equivalent to previously known examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2010
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2010.09.001